0.07/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s 0.14/0.36 % Computer : n001.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 300 0.14/0.36 % WCLimit : 300 0.14/0.36 % DateTime : Fri Jul 5 04:23:54 EDT 2024 0.14/0.37 % CPUTime : 0.14/0.38 This is a THF_ problem 0.14/0.38 Running vampire_ho --cores 8 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.14/0.39 % (28715)dis+10_1:128_hud=1:i=96:si=on:rtra=on_0 on theBenchmark for (3000ds/96Mi) 0.14/0.39 % (28715)First to succeed. 0.14/0.39 % (28715)Refutation found. Thanks to Tanya! 0.14/0.39 % SZS status Theorem for theBenchmark 0.14/0.39 % SZS output start Proof for theBenchmark 0.14/0.39 thf(func_def_0, type, in: $i > ($i > $o) > $o). 0.14/0.39 thf(func_def_2, type, is_a: $i > ($i > $o) > $o). 0.14/0.39 thf(func_def_3, type, emptyset: $i > $o). 0.14/0.39 thf(func_def_4, type, unord_pair: $i > $i > $i > $o). 0.14/0.39 thf(func_def_5, type, singleton: $i > $i > $o). 0.14/0.39 thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.39 thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.39 thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.39 thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o). 0.14/0.39 thf(func_def_10, type, complement: ($i > $o) > $i > $o). 0.14/0.39 thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o). 0.14/0.39 thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o). 0.14/0.39 thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o). 0.14/0.39 thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o). 0.14/0.39 thf(func_def_28, type, sK0: $i > $o). 0.14/0.39 thf(func_def_29, type, sK1: $i > $o). 0.14/0.39 thf(func_def_31, type, ph3: !>[X0: $tType]:(X0)). 0.14/0.39 thf(f118,plain,( 0.14/0.39 $false), 0.14/0.39 inference(avatar_sat_refutation,[],[f104,f110,f111,f114,f117])). 0.14/0.39 thf(f117,plain,( 0.14/0.39 ~spl2_1 | ~spl2_4), 0.14/0.39 inference(avatar_contradiction_clause,[],[f116])). 0.14/0.39 thf(f116,plain,( 0.14/0.39 $false | (~spl2_1 | ~spl2_4)), 0.14/0.39 inference(trivial_inequality_removal,[],[f115])). 0.14/0.39 thf(f115,plain,( 0.14/0.39 ($true = $false) | (~spl2_1 | ~spl2_4)), 0.14/0.39 inference(backward_demodulation,[],[f108,f93])). 0.14/0.39 thf(f93,plain,( 0.14/0.39 ($false = (sK0 @ sK4)) | ~spl2_1), 0.14/0.39 inference(avatar_component_clause,[],[f91])). 0.14/0.39 thf(f91,plain,( 0.14/0.39 spl2_1 <=> ($false = (sK0 @ sK4))), 0.14/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])). 0.14/0.39 thf(f108,plain,( 0.14/0.39 ($true = (sK0 @ sK4)) | ~spl2_4), 0.14/0.39 inference(avatar_component_clause,[],[f106])). 0.14/0.39 thf(f106,plain,( 0.14/0.39 spl2_4 <=> ($true = (sK0 @ sK4))), 0.14/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_4])])). 0.14/0.39 thf(f114,plain,( 0.14/0.39 ~spl2_2 | ~spl2_3), 0.14/0.39 inference(avatar_contradiction_clause,[],[f113])). 0.14/0.39 thf(f113,plain,( 0.14/0.39 $false | (~spl2_2 | ~spl2_3)), 0.14/0.39 inference(trivial_inequality_removal,[],[f112])). 0.14/0.39 thf(f112,plain,( 0.14/0.39 ($true = $false) | (~spl2_2 | ~spl2_3)), 0.14/0.39 inference(backward_demodulation,[],[f97,f102])). 0.14/0.39 thf(f102,plain,( 0.14/0.39 ($false = (sK1 @ sK4)) | ~spl2_3), 0.14/0.39 inference(avatar_component_clause,[],[f100])). 0.14/0.39 thf(f100,plain,( 0.14/0.39 spl2_3 <=> ($false = (sK1 @ sK4))), 0.14/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_3])])). 0.14/0.39 thf(f97,plain,( 0.14/0.39 ($true = (sK1 @ sK4)) | ~spl2_2), 0.14/0.39 inference(avatar_component_clause,[],[f95])). 0.14/0.39 thf(f95,plain,( 0.14/0.39 spl2_2 <=> ($true = (sK1 @ sK4))), 0.14/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])). 0.14/0.39 thf(f111,plain,( 0.14/0.39 spl2_2), 0.14/0.39 inference(avatar_split_clause,[],[f89,f95])). 0.14/0.39 thf(f89,plain,( 0.14/0.39 ($true = (sK1 @ sK4))), 0.14/0.39 inference(duplicate_literal_removal,[],[f86])). 0.14/0.39 thf(f86,plain,( 0.14/0.39 ($true = (sK1 @ sK4)) | ($true = (sK1 @ sK4))), 0.14/0.39 inference(binary_proxy_clausification,[],[f77])). 0.14/0.39 thf(f77,plain,( 0.14/0.39 ($true = (sK1 @ sK4)) | ($true = ((~ (sK0 @ sK4)) & (sK1 @ sK4)))), 0.14/0.39 inference(binary_proxy_clausification,[],[f67])). 0.14/0.39 thf(f67,plain,( 0.14/0.39 ($true = ((~ ((sK0 @ sK4) & (sK1 @ sK4))) & (sK1 @ sK4))) | ($true = ((~ (sK0 @ sK4)) & (sK1 @ sK4)))), 0.14/0.39 inference(binary_proxy_clausification,[],[f66])). 0.14/0.39 thf(f66,plain,( 0.14/0.39 (((~ ((sK0 @ sK4) & (sK1 @ sK4))) & (sK1 @ sK4)) != ((~ (sK0 @ sK4)) & (sK1 @ sK4)))), 0.14/0.39 inference(beta_eta_normalization,[],[f65])). 0.14/0.39 thf(f65,plain,( 0.14/0.39 (((^[Y0 : $i]: ((~ (sK0 @ Y0)) & (sK1 @ Y0))) @ sK4) != ((^[Y0 : $i]: ((~ ((sK0 @ Y0) & (sK1 @ Y0))) & (sK1 @ Y0))) @ sK4))), 0.14/0.39 inference(negative_extensionality,[],[f64])). 0.14/0.39 thf(f64,plain,( 0.14/0.39 ((^[Y0 : $i]: ((~ ((sK0 @ Y0) & (sK1 @ Y0))) & (sK1 @ Y0))) != (^[Y0 : $i]: ((~ (sK0 @ Y0)) & (sK1 @ Y0))))), 0.14/0.39 inference(beta_eta_normalization,[],[f63])). 0.14/0.39 thf(f63,plain,( 0.14/0.39 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))) @ sK1 @ sK0) != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))) @ sK1 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))) @ sK1 @ sK0)))), 0.14/0.39 inference(definition_unfolding,[],[f51,f48,f52,f48])). 0.14/0.39 thf(f52,plain,( 0.14/0.39 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))), 0.14/0.39 inference(cnf_transformation,[],[f19])). 0.14/0.39 thf(f19,plain,( 0.14/0.39 (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))), 0.14/0.39 inference(fool_elimination,[],[f18])). 0.14/0.39 thf(f18,plain,( 0.14/0.39 (intersection = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) & (X1 @ X2))))), 0.14/0.39 inference(rectify,[],[f8])). 0.14/0.39 thf(f8,axiom,( 0.14/0.39 (intersection = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) & (X2 @ X3))))), 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection)). 0.14/0.39 thf(f48,plain,( 0.14/0.39 (setminus = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))))), 0.14/0.39 inference(cnf_transformation,[],[f41])). 0.14/0.39 thf(f41,plain,( 0.14/0.39 (setminus = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((~ (Y1 @ Y2)) & (Y0 @ Y2))))))))), 0.14/0.39 inference(fool_elimination,[],[f40])). 0.14/0.39 thf(f40,plain,( 0.14/0.39 (setminus = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) & ~(X1 @ X2))))), 0.14/0.39 inference(rectify,[],[f9])). 0.14/0.39 thf(f9,axiom,( 0.14/0.39 (setminus = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) & ~(X2 @ X3))))), 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminus)). 0.14/0.39 thf(f51,plain,( 0.14/0.39 ((setminus @ sK1 @ (intersection @ sK1 @ sK0)) != (setminus @ sK1 @ sK0))), 0.14/0.39 inference(cnf_transformation,[],[f46])). 0.14/0.39 thf(f46,plain,( 0.14/0.39 ((setminus @ sK1 @ (intersection @ sK1 @ sK0)) != (setminus @ sK1 @ sK0))), 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f44,f45])). 0.14/0.39 thf(f45,plain,( 0.14/0.39 ? [X0 : $i > $o,X1 : $i > $o] : ((setminus @ X1 @ (intersection @ X1 @ X0)) != (setminus @ X1 @ X0)) => ((setminus @ sK1 @ (intersection @ sK1 @ sK0)) != (setminus @ sK1 @ sK0))), 0.14/0.39 introduced(choice_axiom,[])). 0.14/0.39 thf(f44,plain,( 0.14/0.39 ? [X0 : $i > $o,X1 : $i > $o] : ((setminus @ X1 @ (intersection @ X1 @ X0)) != (setminus @ X1 @ X0))), 0.14/0.39 inference(ennf_transformation,[],[f43])). 0.14/0.39 thf(f43,plain,( 0.14/0.39 ~! [X0 : $i > $o,X1 : $i > $o] : ((setminus @ X1 @ (intersection @ X1 @ X0)) = (setminus @ X1 @ X0))), 0.14/0.40 inference(rectify,[],[f16])). 0.14/0.40 thf(f16,negated_conjecture,( 0.14/0.40 ~! [X2 : $i > $o,X0 : $i > $o] : ((setminus @ X0 @ (intersection @ X0 @ X2)) = (setminus @ X0 @ X2))), 0.14/0.40 inference(negated_conjecture,[],[f15])). 0.14/0.40 thf(f15,conjecture,( 0.14/0.40 ! [X2 : $i > $o,X0 : $i > $o] : ((setminus @ X0 @ (intersection @ X0 @ X2)) = (setminus @ X0 @ X2))), 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)). 0.14/0.40 thf(f110,plain,( 0.14/0.40 spl2_3 | spl2_4), 0.14/0.40 inference(avatar_split_clause,[],[f76,f106,f100])). 0.14/0.40 thf(f76,plain,( 0.14/0.40 ($true = (sK0 @ sK4)) | ($false = (sK1 @ sK4))), 0.14/0.40 inference(duplicate_literal_removal,[],[f75])). 0.14/0.40 thf(f75,plain,( 0.14/0.40 ($true = (sK0 @ sK4)) | ($false = (sK1 @ sK4)) | ($true = (sK0 @ sK4))), 0.14/0.40 inference(binary_proxy_clausification,[],[f73])). 0.14/0.40 thf(f73,plain,( 0.14/0.40 ($true = (sK0 @ sK4)) | ($false = (sK1 @ sK4)) | ($true = ((sK0 @ sK4) & (sK1 @ sK4)))), 0.14/0.40 inference(not_proxy_clausification,[],[f72])). 0.14/0.40 thf(f72,plain,( 0.14/0.40 ((~ (sK0 @ sK4)) = $false) | ($true = ((sK0 @ sK4) & (sK1 @ sK4))) | ($false = (sK1 @ sK4))), 0.14/0.40 inference(duplicate_literal_removal,[],[f71])). 0.14/0.40 thf(f71,plain,( 0.14/0.40 ($false = (sK1 @ sK4)) | ($true = ((sK0 @ sK4) & (sK1 @ sK4))) | ((~ (sK0 @ sK4)) = $false) | ($false = (sK1 @ sK4))), 0.14/0.40 inference(binary_proxy_clausification,[],[f70])). 0.14/0.40 thf(f70,plain,( 0.14/0.40 ($false = (sK1 @ sK4)) | ($false = ((~ (sK0 @ sK4)) & (sK1 @ sK4))) | ($true = ((sK0 @ sK4) & (sK1 @ sK4)))), 0.14/0.40 inference(not_proxy_clausification,[],[f69])). 0.14/0.40 thf(f69,plain,( 0.14/0.40 ($false = (~ ((sK0 @ sK4) & (sK1 @ sK4)))) | ($false = ((~ (sK0 @ sK4)) & (sK1 @ sK4))) | ($false = (sK1 @ sK4))), 0.14/0.40 inference(binary_proxy_clausification,[],[f68])). 0.14/0.40 thf(f68,plain,( 0.14/0.40 ($false = ((~ ((sK0 @ sK4) & (sK1 @ sK4))) & (sK1 @ sK4))) | ($false = ((~ (sK0 @ sK4)) & (sK1 @ sK4)))), 0.14/0.40 inference(binary_proxy_clausification,[],[f66])). 0.14/0.40 thf(f104,plain,( 0.14/0.40 spl2_3 | spl2_1), 0.14/0.40 inference(avatar_split_clause,[],[f84,f91,f100])). 0.14/0.40 thf(f84,plain,( 0.14/0.40 ($false = (sK0 @ sK4)) | ($false = (sK1 @ sK4))), 0.14/0.40 inference(duplicate_literal_removal,[],[f83])). 0.14/0.40 thf(f83,plain,( 0.14/0.40 ($false = (sK0 @ sK4)) | ($false = (sK1 @ sK4)) | ($false = (sK0 @ sK4))), 0.14/0.40 inference(not_proxy_clausification,[],[f82])). 0.14/0.40 thf(f82,plain,( 0.14/0.40 ($false = (sK0 @ sK4)) | ($false = (sK1 @ sK4)) | ($true = (~ (sK0 @ sK4)))), 0.14/0.40 inference(binary_proxy_clausification,[],[f81])). 0.14/0.40 thf(f81,plain,( 0.14/0.40 (((sK0 @ sK4) & (sK1 @ sK4)) = $false) | ($true = (~ (sK0 @ sK4)))), 0.14/0.40 inference(binary_proxy_clausification,[],[f79])). 0.14/0.40 thf(f79,plain,( 0.14/0.40 ($true = ((~ (sK0 @ sK4)) & (sK1 @ sK4))) | (((sK0 @ sK4) & (sK1 @ sK4)) = $false)), 0.14/0.40 inference(not_proxy_clausification,[],[f78])). 0.14/0.40 thf(f78,plain,( 0.14/0.40 ($true = (~ ((sK0 @ sK4) & (sK1 @ sK4)))) | ($true = ((~ (sK0 @ sK4)) & (sK1 @ sK4)))), 0.14/0.40 inference(binary_proxy_clausification,[],[f67])). 0.14/0.40 % SZS output end Proof for theBenchmark 0.14/0.40 % (28715)------------------------------ 0.14/0.40 % (28715)Version: Vampire 4.7 (commit 934bd2fae on 2023-06-16 16:02:25 +0100) 0.14/0.40 % (28715)Termination reason: Refutation 0.14/0.40 0.14/0.40 % (28715)Memory used [KB]: 5500 0.14/0.40 % (28715)Time elapsed: 0.005 s 0.14/0.40 % (28715)Instructions burned: 5 (million) 0.14/0.40 % (28715)------------------------------ 0.14/0.40 % (28715)------------------------------ 0.14/0.40 % (28714)Success in time 0.013 s 0.14/0.40 % Vampire---4.8 exiting 0.14/0.40 EOF